Relational Nested Optional Join for Efficient Semantic Web Query Processing
نویسندگان
چکیده
Increasing amount of RDF data on the Web drives the need for its efficient and effective management. In this light, numerous researchers have proposed to use RDBMSs to store and query RDF annotations using the SQL and SPARQL query languages. The first few attempts at SPARQL-to-SQL translation revealed non-trivial challenges related to correctness and efficiency of such translation in the presence of nested optional graph patterns. In this paper, we propose to extend relational databases with a novel relational operator, nested optional join (NOJ), that is more efficient than left outer join in processing nested optional graph patterns. We design three efficient algorithms to implement the new operator in relational databases: (1) nested-loops NOJ algorithm, NL-NOJ, (2) sort-merge NOJ algorithm, SM-NOJ, and (3) simple hash NOJ algorithm, SH-NOJ. Based on a real life RDF dataset, we demonstrate the efficiency of our algorithms by comparing them with the corresponding left outer join implementations.
منابع مشابه
Efficient Processing of RDF Queries with Nested Optional Graph Patterns in an RDBMS
Relational technology has shown to be very useful for scalable Semantic Web data management. Numerous researchers have proposed to use RDBMSs to store and query voluminous RDF data using SQL and RDF query languages. In this article, we study how RDF queries with the socalled well-designed graph patterns and nested optional patterns can be efficiently evaluated in an RDBMS. We propose to extend ...
متن کاملSemantics preserving SQL-to-SPARQL query translation for Nested Right and Left Outer Join
Despite the emergence of semantic web due to its high performance in managing a large amount of data through semantic filters, the relational databases are still the most used. Therefore establishing a connection between both heterogeneous systems becomes a relevant need so as to bridge the gap between them. Regarding the query mapping from relational world to semantic world (SQL-to-SPARQL), so...
متن کاملFrom SPARQL to MapReduce: The Journey Using a Nested TripleGroup Algebra
MapReduce-based data processing platforms offer a promising approach for cost-effective and Web-scale processing of Semantic Web data. However, one major challenge is that this computational paradigm leads to high I/O and communication costs when processing tasks with several join operations typical in SPARQL queries. The goal of this demonstration is to show how a system RAPID+, an extension o...
متن کاملCascading map-side joins over HBase for scalable join processing
One of the major challenges in large-scale data processing with MapReduce is the smart computation of joins. Since Semantic Web datasets published in RDF have increased rapidly over the last few years, scalable join techniques become an important issue for SPARQL query processing as well. In this paper, we introduce the Map-Side Index Nested Loop Join (MAPSIN join) which combines scalable index...
متن کاملCost Analysis of Joins in RDF Query Processing Using the TripleT Index
Cost Analysis of Joins in RDF Query Processing Using the TripleT Index By Kanwei Li The Semantic Web movement has led to a growing popularity of RDF and its query languages. Clearly, good query performance is important in allowing information to be quickly retrieved from RDF datasets that are everincreasing in size. We use the TripleT indexing scheme for RDF data as a framework to examine the c...
متن کامل